An efficient decision procedure for the theory of rational order

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Decision Procedure for UTVPI Constraints

A unit two variable per inequality (UTVPI) constraint is of the form a.x+b.y ≤ d where x and y are integer variables, the coefficients a, b ∈ {−1, 0, 1} and the bound d is an integer constant. This paper presents an efficient decision procedure for UTVPI constraints. Given m such constraints over n variables, the procedure checks the satisfiability of the constraints in O(n.m) time and O(n+m) s...

متن کامل

Rational Choice Theory: An Overview

It seems easy to accept that rationality involves many features that cannot be summarized in terms of some straightforward formula, such as binary consistency.  However, this recognition does not immediately lead to alternative characterizations that might be regarded as satisfactory, even though the inadequacies of the traditional assumptions of rational behavior standard used in economic theo...

متن کامل

Rational Choice Theory: An Overview

It seems easy to accept that rationality involves many features that cannot be summarized in terms of some straightforward formula, such as binary consistency.  However, this recognition does not immediately lead to alternative characterizations that might be regarded as satisfactory, even though the inadequacies of the traditional assumptions of rational behavior standard used in economic theo...

متن کامل

An Efficient Decision Procedure for the Theory of Fixed-Sized Bit-Vectors

In this paper we describe a decision procedure for the core theory of xed-sized bit-vectors with extraction and composition than can readily be integrated into Shostak's procedure for deciding combinations of theories. Inputs to the solver are unquantiied bit-vector equations t = u and the algorithm returns true if t = u is valid in the bit-vector theory, false if t = u is unsatissable, and a s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1977

ISSN: 0304-3975

DOI: 10.1016/0304-3975(77)90037-8